By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 15, Issue 1, pp. 1-141

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs

M. A. Fiol and E. Garriga

pp. 1-13

BibTeX  Abstract Full Text:  PDF

Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound

T. Blackmore and G. H. Norton

pp. 14-40

BibTeX  Abstract Full Text:  PDF

On the Distributed Complexity of Computing Maximal Matchings

Michal Hanckowiak, Michal Karonski, and Alessandro Panconesi

pp. 41-57

BibTeX  Abstract Full Text:  PDF

Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms

Noga Alon, Benny Sudakov, and Uri Zwick

pp. 58-72

BibTeX  Abstract Full Text:  PDF

Neighborhood Preserving Hashing and Approximate Queries

Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, and Michal Parnas

pp. 73-85

BibTeX  Abstract Full Text:  PDF

On Covering a Bipartite Graph with Cycles

Hong Wang

pp. 86-96

BibTeX  Abstract Full Text:  PDF

Practical Approximation Algorithms for Zero- and Bounded-Skew Trees

Alexander Z. Zelikovsky and Ion I. Mandoiu

pp. 97-111

BibTeX  Abstract Full Text:  PDF

Facets of the Weak Order Polytope Derived from the Induced Partition Projection

Jean-Paul Doignon and Samuel Fiorini

pp. 112-121

BibTeX  Abstract Full Text:  PDF

Efficiency of Local Search with Multiple Local Optima

Josselin Garnier and Leila Kallel

pp. 122-141

BibTeX  Abstract Full Text:  PDF